Packetized MPC with dynamic scheduling constraints and bounded packet dropouts
نویسندگان
چکیده
منابع مشابه
Packet Scheduling with Window Service Constraints
This paper considers the scheduling problem that minimizes the average response time of two jobs subject to window constraints. By window constraints, we mean that within a fixed time interval, the server can serve at mostW packets from one job, where W is called the window size of the job. This paper investigates the effects of the window constraints in detail, and derives the optimal policy. ...
متن کاملOnline Packet Scheduling with Bounded Delay and Lookahead
We study the online bounded-delay packet scheduling problem (PacketScheduling), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the litera...
متن کاملPacket Scheduling in a Size-Bounded Buffer
We consider algorithms to schedule packets with values and deadlines in a size-bounded buffer. At any time, the buffer can store at most B packets. Packets arrive over time. Each packet has a non-negative value and an integer deadline. In each time step, at most one packet can be sent. Packets can be dropped at any time before they are sent. The objective is to maximize the total value gained b...
متن کاملBounded delay packet scheduling in a bounded buffer
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the more realistic situation where the network switch has a finite buffer size. A 9.82-competitive algorithm is known for the case of multiple buffers (Azar and Levy, SWAT’06). Recently, for the case of a single buffer, a ...
متن کاملRobust H∞ Control of Networked Control Systems with Access Constraints and Packet Dropouts
We consider a class of networked control systems (NCSs) where the plant has time-varying norm-bounded parameter uncertainties, the network only provides a limited number of simultaneous accesses for the sensors and actuators, and the packet dropouts occur randomly in the network. For this class of NCSs with uncertainties and access constraints as well as packet dropouts, we derive sufficient co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2014
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2013.12.031